Formal Justification of the Rely-Guarantee Paradigm for Shared-Variable Concurrency: A Semantic Approach
نویسندگان
چکیده
This paper introduces a semantic analysis of the Rely-Guarantee (R-G) approach to the compositional verification of shared-variable concurrency. The main contribution is a new completeness proof.
منابع مشابه
Probabilistic rely-guarantee calculus
Jones’ rely-guarantee calculus [1] for shared variable concurrency is extended to include probabilistic behaviours. We use an algebraic approach which combines and adapts probabilistic Kleene algebras with concurrent Kleene algebra. Soundness of the algebra is shown relative to a general probabilistic event structure semantics [21]. The main contribution of this paper is a collection of rely-gu...
متن کاملHoare-Style Compositional Proof Systems for Reactive Shared Variable Concurency
A new compositional logic for verifying safety properties of shared variable concurrency is presented, in which, in order to characterize in nite computations, a Hoare-style I/pre/post format is used where I expresses the communication interface, enabling the characterization of reactive programs. This logic relates to the Rely/Guarantee paradigm of Jones [11], in that Rely/Guarantee formulae c...
متن کاملTowards a Formal Treatment of Implicit Invocation
Implicit invocation [SN92,GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of speci cation and veri cation formalisms for such systems. A formal computational model for implicit invocation is presented. We develop a veri cation framework for implicit invocation that is based on Jones' rely/guarantee reasoning for concur...
متن کاملCompositional Reasoning for Shared-variable Concurrent Programs
Scalable and automatic formal verification for concurrent systems is always demanding, but yet to be developed. In this paper, we propose a verification framework to support automated compositional reasoning for concurrent programs with shared variables. Our framework models concurrent programs as succinct automata and supports the verification of multiple important properties. Safety verificat...
متن کاملPossible values: Exploring a concept for concurrency
An important issue in concurrency is interference. This issue manifests itself in both shared-variable and communication-based concurrency — this paper focusses on the former case where interference is caused by the environment of a process changing the values of shared variables. Rely/guarantee approaches have been shown to be useful in specifying and reasoning compositionally about concurrent...
متن کامل